Computing the largest inscribed isothetic rectangle
نویسندگان
چکیده
This paper describes an algorithm to compute, in (log n) time, a rectangle that is contained in a convex n-gon, has sides parallel to the coordinate axes, and has maximum area. With a slight modiication it will compute the smallest perimeter. The algorithm uses a tentative prune-and-search approach, even though this problem does not appear to t into the functional framework of Kirkpatrick and Snoeyink.
منابع مشابه
Algorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملLargest inscribed rectangles in convex polygons
We consider approximation algorithms for the problem of computing an inscribed rectangle having largest area in a convex polygon on n vertices. If the order of the vertices of the polygon is given, we present a randomized algorithm that computes an inscribed rectangle with area at least (1− ) times the optimum with probability t in time O( 1 log n) for any constant t < 1. We further give a dete...
متن کاملLargest Inscribed Rectangles in Convex Polygons ( Extended Abstract ) ∗
We consider approximation algorithms for the problem of computing an inscribed rectangle having largest area in a convex polygon on n vertices. If the order of the vertices of the polygon is given, we present a deterministic approximation algorithm that computes an inscribed rectangle of area at least 1− times the optimum in running time O( 1 log 1 log n). Furthermore, a randomized approximatio...
متن کاملEnumeration of inscribed polyominos
We introduce a new family of polyominos that are inscribed in a rectangle of given size for which we establish a number of exact formulas and generating functions. In particular, we study polyominos inscribed in a rectangle with minimum area and minimum area plus one. These results are then used for the enumeration of lattice trees inscribed in a rectangle with minimum area plus one. Résumé. No...
متن کاملPartitioning orthogonal polygons into fat rectangles in polynomial time
We provide a polynomial-time algorithm to partition an orthogonal polygon of n vertices into isothetic rectangles so that the shortest rectangle side is maximized over all rectangles. Thus no rectangle is “thin”; all rectangles are “fat.”
متن کامل